Relative expressiveness of defeasible logics II
نویسندگان
چکیده
منابع مشابه
Relative expressiveness of defeasible logics II
(Maher 2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the defeasible logics in the DL framework are equally expressive under this formulation of relative expressiveness. The second formulation of relative expressiveness i...
متن کاملRelative expressiveness of defeasible logics
We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be modular, in the sense that they also work if applied only to part of a theory, in order to achieve a useful notion of relative expressiveness. We present simulation...
متن کاملRelative Expressiveness of Well-Founded Defeasible Logics
An approach to formulating relative expressiveness of defeasible logics was introduced in [14]. In this paper we address the relative expressiveness of the well-founded defeasible logics in the framework WFDL and their relationship to the defeasible logics in the framework DL. We show that, in terms of defeasible reasoning, the logics in WFDL have greater (or equal) expressiveness than those in...
متن کاملRelative Expressiveness of Defeasible Logics II published in Theory and Practice of Logic Programming
For every inference rule +d there is a closely related inference rule −d allowing to infer that some literals q cannot be consequences of D via +d. The relationship between +d and −d is described as the Principle of Strong Negation (Antoniou et al. 2000). These inference rules are placed adjacently to emphasize this relationship. Some notation in the inference rules requires explanation. Given ...
متن کاملOn the Relative Expressiveness of Description Logics and Predicate Logics
It is natural to view concept and role definitions in Description Logics as expressing monadic and dyadic predicates in Predicate Calculus. We show that the descriptions built using the constructors usually considered in the DL literature are characterized exactly as the predicates definable by formulas in L̈3, the subset of First Order Predicate Calculus with monadic and dyadic predicates which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2013
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068413000367